/// @tags:
#include <cstdio>
#include <functional>
#include <iostream>
#include <numeric>

using std::cin, std::cout, std::endl;

namespace BlueQuantum {

constexpr int maxn = 100;

int ecnt;
int heads[maxn];

struct Edge {
  int v, nxt;
} e[maxn * 2];

inline void add(int u, int v) {
  e[++ecnt].v = v, e[ecnt].nxt = heads[u], heads[u] = ecnt;
}

void dfs(int u, int fa) {
  int cnt = 0;
  for (int i = heads[u]; i; i = e[i].nxt) {
    int v = e[i].v;
    ++cnt;
    if (v == fa) {
      continue;
    }
    dfs(v, u);
  }
  if (cnt == 1) {
    
  }
}

char str[maxn + 1];

void solve() {
  int n;
  cin >> n;
  for (int i = 1; i < n; ++i) {
    int u, v;
    cin >> u >> v;
    add(u, v);
    add(v, u);
  }
  cin >> (str + 1);
  dfs(1, 1);
}

int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}

}  // namespace BlueQuantum

int main() {
#ifndef ONLINE_JUDGE
#ifdef LOCAL
  freopen("/tmp/CodeTmp/testdata.in", "r", stdin);
  freopen("/tmp/CodeTmp/testdata.out", "w", stdout);
#else
  freopen("C - Dyed by Majority (Odd Tree).in", "r", stdin);
  freopen("C - Dyed by Majority (Odd Tree).out", "w", stdout);
#endif
#endif

  std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  return BlueQuantum::main();
}
